"查查詞典"手機(jī)版
千萬人都在用的超大詞匯詞典翻譯APP
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. A classic example is the lambda calculus.
詳細(xì)百科解釋